sink node

См. также в других словарях:

• Sink (disambiguation) — Sink may refer to:* Sink, a bowl shaped fixture, usually made of porcelain or stainless steel, that is used for washing hands or small objects * Sink (geography), an area of dry land below sea level, for example the Salton Sink * Sink… …   Wikipedia

• Money Sink — Mudflation bezeichnet eine spezielle Form der Inflation innerhalb von virtuellen Spielwelten, wie MMORPGs oder MUDs. Es bezeichnet den Verfall der Währung oder den Verfall der Nützlichkeit von Gegenständen (etwa Waffen, Rüstungen usw.) und geht… …   Deutsch Wikipedia

• Ford-Fulkerson algorithm — The Ford Fulkerson algorithm (named for L. R. Ford, Jr. and D. R. Fulkerson) computes the maximum flow in a flow network. It was published in 1956. The name Ford Fulkerson is often also used for the Edmonds Karp algorithm, which is a… …   Wikipedia

• Edmonds-Karp algorithm — In computer science and graph theory, the Edmonds Karp algorithm is an implementation of the Ford Fulkerson method for computing the maximum flow in a flow network in mathcal{O}(|V| cdot |E|^2). It is asymptotically slower than the relabel to… …   Wikipedia

• Red de sensores — Saltar a navegación, búsqueda Una red de sensores (del inglés sensor network) es una red de ordenadores pequeñísimos («nodos»), equipados con sensores, que colaboran en una tarea común. Las redes de sensores están formadas por un grupo de… …   Wikipedia Español

• узел приемника — (МСЭ Т G.808.1). [http://www.iks media.ru/glossary/index.html?glossid=2400324] Тематики электросвязь, основные понятия EN sink node …   Справочник технического переводчика

• узел стока — — [Л.Г.Суменко. Англо русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.] Тематики информационные технологии в целом EN sink node …   Справочник технического переводчика

• Maximum flow problem — An example of a flow network with a maximum flow. The source is s, and the sink t. The numbers denote flow and capacity. In optimization theory, the maximum flow problem is to find a feasible flow through a single source, single sink flow network …   Wikipedia

• Push-relabel maximum flow algorithm — The push relabel algorithm is one of the most efficient algorithms to compute a maximum flow. The general algorithm has O(V^2 E) time complexity, while the implementation with FIFO vertex selection rule has O(V^3) running time, the highest active …   Wikipedia

• Flow network — In graph theory, a flow network is a directed graph where each edge has a capacity and each edge receives a flow. The amount of flow on an edge cannot exceed the capacity of the edge. Often in Operations Research, a directed graph is called a… …   Wikipedia

• angiosperm — /an jee euh sperrm /, n. Bot. a plant having its seeds enclosed in an ovary; a flowering plant. Cf. gymnosperm. [ANGIO + SPERM] * * * ▪ plant Introduction       any member of the more than 300,000 species of flowering plants (division Anthophyta) …   Universalium